Buffer Sizing for Rate-Optimal Single-Rate Data-Flow Scheduling Revisited
نویسندگان
چکیده
منابع مشابه
Optimal buffer size and dynamic rate control for a queueing
We address a rate control problem associated with a single server Markovian queueing system with customer abandonment in heavy traffic. The controller can choose a buffer size for the queuing network and also can dynamically control the service rate (equivalently the arrival rate) depending on the current state of the network. An infinite horizon cost minimization problem is considered here. Th...
متن کاملOptimal Source Coding Rate for Limited Buffer Size
We consider the problem of choosing the optimal rate control for a source coder when transmitting lossy-compressed data in real-time over a channel with time-varying rate. Optimality is in the sense of minimizing average distortion. The real-time constraint is formulated as a limited buffer size. Our result is that optimal rate should be piecewise constant and only change when buffer is full or...
متن کاملDisk Scheduling for Variable-Rate Data Streams
We describe three disk scheduling algorithms that can be used in a multimedia server for sustaining a number of heterogeneous variable-rate data streams. A data stream is supported by repeatedly fetching a block of data from the storage device and storing it in a corresponding buffer. For each of the disk scheduling algorithms we give necessary and sufficient conditions for avoiding underand ov...
متن کاملRate Optimal VLSI Design from Data Flow Graph
This paper considers the rate optimal VLSI design of a recursive data ow graph (DFG). Previous research on rate optimal scheduling is not directly applicable to VLSI design. We propose a technique that inserts bu er registers to allow overlapped rate optimal implementation of VLSI. We illustrate that nonoverlapped schedules can be implemented by a simpler control path but with a larger unfoldin...
متن کاملPower-optimal Simultaneous Buffer Insertion/sizing and Wire Sizing
This paper studies the problems of minimizing power dissipation of an interconnect wire by simultaneously considering buffer insertion/sizing and wire sizing (BISWS). We consider two cases, namely minimizing power dissipation with optimal delay constraints, and minimizing power dissipation with a given delay penalty. We derive closed form optimal solutions for both cases. These closed form solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2010
ISSN: 0018-9340
DOI: 10.1109/tc.2009.155